A note on large-buffer asymptotics for generalized processor sharing with Gaussian inputs
نویسندگان
چکیده
In a previous study logarithmic large-buffer asymptotics were derived for a two-class generalized processor sharing system with Gaussian inputs, for three of the four possible scenarios. In this note we show how the large-buffer asymptotics for the remaining fourth regime follow from a recently derived result for tandem systems. We also provide a heuristic interpretation of the result. 2000 Mathematics Subject Classification: 60K25
منابع مشابه
Buffer Occupancy and Delay Asymptotics in Multi-buffered Systems with Generalized Processor Sharing Handling a Large Number of Independent Traffic Streams∗
In this paper we study a multi-buffer Generalized Processor Sharing (GPS ) scheduled system in the so-called many sources regime resulting from multiplexing a large number of independent stationary input streams in each of the buffers. The notion of largeness is via the notion of scaling by which the buffer occupancy and the server speed are scaled in proportion to the number of inputs in such ...
متن کاملAsymptotic analysis of GPS systems fed by heterogeneous long-tailed sources
In this paper we consider a multi-buffered system consisting of N buffers accessed by heterogeneous longtailed sessions and served according to the Generalized Processor Sharing (GPS) discipline with weights f ig. We assume that sessions arrive according to a Poisson process. A session of type i transmits at rate ri and has a duration whose distribution is longtailed of the form P ( i > t) it (...
متن کاملLarge deviations for complex buffer architectures: the short-range dependent case
This paper considers Gaussian flows multiplexed in a queueing network, where the underlying correlation structure is assumed to be short-range dependent. Whereas previous work mainly focused on the FIFO setting, this paper addresses overflow characteristics of more complex buffer architectures. We subsequently analyze the tandem queue, a priority system, and generalized processor sharing. In a ...
متن کاملBuffer occupancy asymptotics in rate proportional sharing networks with heterogeneous long-tailed inputs
In this paper, we consider a network of rate proportional processor sharing servers in which sessions with long-tailed duration arrive as Poisson processes. In particular, we assume that a session of type n transmits at a rate rn bits per unit time and lasts for a random time τn with a generalized Pareto distribution given by IP{τn > x} ∼ αnxn for large x, where αn, βn > 0. The weights are take...
متن کاملMultiplexing Regulated Traffic Streams: Design and Performance
The main network solutions for supporting QoS rely on traffic policing (conditioning, shaping). In particular, for IP networks the IETF has developed Intserv (individual flows regulated) and Diffserv (only aggregates regulated). The regulator proposed could be based on the (dual) leaky-bucket mechanism. This explains the interest in network element performance (loss, delay) for leaky-bucket reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 55 شماره
صفحات -
تاریخ انتشار 2007